Quasiextremal distance sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Different-Distance Sets in a Graph

A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...

متن کامل

New distance and similarity measures for hesitant fuzzy soft sets

The hesitant fuzzy soft set (HFSS), as a combination of hesitant fuzzy and soft sets, is regarded as a useful tool for dealing with the uncertainty and ambiguity of real-world problems. In HFSSs, each element is defined in terms of several parameters with arbitrary membership degrees. In addition, distance and similarity measures are considered as the important tools in different areas such as ...

متن کامل

Spherical two-distance sets

A set S of unit vectors in n−dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b so that the inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical two-distance sets does not exceed n(n+3)/2. This upper bound is known to be tight for n = 2, 6, 22. The set of midpoints of the edges of a regular simplex g...

متن کامل

Intersections of Sets of Distance

We isolate conditions on the relative asymptotic size of sets of natural numbers A,B that guarantee a nonempty intersection of the corresponding sets of distances. Such conditions apply to a large class of zero density sets. We also show that a variant of Khintchine’s Recurrence Theorem holds for all infinite sets A = {a1 < a2 < . . .} where ann n3/2.

متن کامل

Level Sets and Distance Functions

This paper is concerned with the simulation of the Partial Diierential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher and Sethian propose to evolve the distance function with a Hamilton-Jacobi equation. Unfortunately t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Analysis

سال: 2003

ISSN: 2196-6753,0174-4747

DOI: 10.1524/anly.2003.23.1.27